Set to set broadcasting in communication networks
نویسندگان
چکیده
منابع مشابه
Minimum Total Communication Power Connected Dominating Set in Wireless Networks
A virtual backbone of a wireless network is a connected subset of nodes responsible for routing messages in the network. A node in the subset is likely to be exhausted much faster than the others due to its heavy duties. This situation can be more aggravated if the node uses higher communication power to form the virtual backbone. In this paper, we introduce the minimum total communication powe...
متن کاملExtended Dominating Set in Ad Hoc Networks Using Cooperative Communication
Abstract. We propose a notion of extended dominating set whereby each node in an ad hoc network is covered by either a dominating neighbor or several 2-hop dominating neighbors. This work is motivated by cooperative communication in ad hoc networks where transmitting independent copies of a packet generates diversity and combats the effects of fading. In this paper we propose several efficient ...
متن کاملk-Set Agreement in Communication Networks with Omission Faults
We consider an arbitrary communication network G where at most f messages can be lost at each round, and consider the classical k-set agreement problem in this setting. We characterize exactly for which f the k-set agreement problem can be solved on G. The case with k = 1, that is the Consensus problem, has first been introduced by Santoro and Widmayer in 1989 [20], the characterization is alre...
متن کاملApplication of cut set method to reliability evaluation of mine ventilation networks
Providing a fresh and cool airflow in underground mines is one of the main concerns during mining. Destruction of support systems, the presence of undesirable objects in the airway and distortion of airflow are the parameters involved that would result in pressure loss, which would affect the ventilation network. There are a lot of research works about the ventilation network planning that cons...
متن کاملThe Impact of Delay in Dominating Set and Neighbor Elimination Based Broadcasting in Ad Hoc Networks
In a broadcasting task, a source sends a message to all the nodes of a network. There exist methods for flooding a network intelligently and for scheduling node activities. Dominating sets and neighbor elimination based broadcasting is currently the most efficient broadcasting scheme in terms of the number of retransmitted messages to complete a broadcast. It provides basis for defining other b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90010-8